Proving Existential Theorems
نویسندگان
چکیده
منابع مشابه
Proving Existential Theorems when Importing Results from MDG to HOL
An existential theorem, for the specification or implementation of hardware, states that for any inputs there must exist at least one output which is consistent with it. It is proved to prevent an inconsistent model being produced and it is required to formally import the verification result from one verification system to another system. In this paper, we investigate the verification of the ex...
متن کاملQuantifier Elimination for Neocompact Sets
We shall prove quantifier elimination theorems for neocompact formulas, which define neocompact sets and are built from atomic formulas using finite disjunctions, infinite conjunctions, existential quantifiers, and bounded universal quantifiers. The neocompact sets were first introduced to provide an easy alternative to nonstandard methods of proving existence theorems in probability theory, wh...
متن کاملProviding a formal linkage between MDG and HOL based on a verified MDG system
We describe a methodology which can provide a formal linkage between a symbolic state enumeration system and a theorem proving system based on a veri ed symbolic state enumeration system. The methodology has been partly realized in a simpli ed version of the MDG system (a symbolic state enumeration system) and the HOL system (a theorem proving system) which involves the following three steps. F...
متن کاملQualitative Theorem Proving in Linear Constraints
We know, from the classical work of Tarski on real closed elds, that elimination is, in principle, a fundamental engine for mechanized deduction. But, in practice, the high complexity of elimination algorithms has limited their use in the realization of mechanical theorem proving. We advocate qualitative theorem proving, where elimination is attractive since most processes of reasoning take pla...
متن کاملSound Lemma Generation for Proving Inductive Validity of Equations
In many automated methods for proving inductive theorems, finding a suitable generalization of a conjecture is a key for the success of proof attempts. On the other hand, an obtained generalized conjecture may not be a theorem, and in this case hopeless proof attempts for the incorrect conjecture are made, which is against the success and efficiency of theorem proving. Urso and Kounalis (2004) ...
متن کامل